By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 1, Issue 4, pp. 281-353

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On Languages Accepted in Polynomial Time

Ronald V. Book

pp. 281-287

BibTeX  Abstract Full Text:  PDF

A Note on the Intersection of Complexity Classes of Functions

Leonard J. Bass

pp. 288-289

BibTeX  Abstract Full Text:  PDF

Analysis and Synthesis of Sorting Algorithms

C. L. Liu

pp. 290-304

BibTeX  Abstract Full Text:  PDF

A Minimum Distance Error-Correcting Parser for Context-Free Languages

Alfred V. Aho and Thomas G. Peterson

pp. 305-312

BibTeX  Abstract Full Text:  PDF

Compatibility and Complexity of Refinements of the Resolution Principle

Richard B. Kieburtz and David Luckham

pp. 313-332

BibTeX  Abstract Full Text:  PDF

Real-Time Strict Deterministic Languages

Michael A. Harrison and Ivan M. Havel

pp. 333-349

BibTeX  Abstract Full Text:  PDF

Infix to Prefix Translation: The Insufficiency of a Pushdown Stack

Edward M. Reingold

pp. 350-353

BibTeX  Abstract Full Text:  PDF